Computer architecture and software cells for broadband networks

ABSTRACT

A computer architecture and programming model for high speed processing over broadband networks are provided. The architecture employs a consistent modular structure, a common computing module and uniform software cells. The common computing module includes a control processor, a plurality of processing units, a plurality of local memories from which the processing units process programs, a direct memory access controller and a shared main memory. A synchronized system and method for the coordinated reading and writing of data to and from the shared main memory by the processing units also are provided. A hardware sandbox structure is provided for security against the corruption of data among the programs being processed by the processing units. The uniform software cells contain both data and applications and are structured for processing by any of the processors of the network. Each software cell is uniquely identified on the network. A system and method for creating a dedicated pipeline for processing streaming data also are provided.

BACKGROUND OF THE INVENTION

[0001] The present invention relates to an architecture for computerprocessors and computer networks and, in particular, to an architecturefor computer processors and computer networks in a broadbandenvironment. The present invention further relates to a programmingmodel for such an architecture.

[0002] The computers and computing devices of current computer networks,e.g., local area networks (LANs) used in office networks and globalnetworks such as the Internet, were designed principally for stand-alonecomputing. The sharing of data and application programs (“applications”)over a computer network was not a principal design goal of thesecomputers and computing devices. These computers and computing devicesalso typically were designed using a wide assortment of differentprocessors made by a variety of different manufacturers, e.g., Motorola,Intel, Texas Instruments, Sony and others. Each of these processors hasits own particular instruction set and instruction set architecture(ISA), i.e., its own particular set of assembly language instructionsand structure for the principal computational units and memory units forperforming these instructions. A programmer is required to understand,therefore, each processor's instruction set and ISA to writeapplications for these processors. This heterogeneous combination ofcomputers and computing devices on today's computer networks complicatesthe processing and sharing of data and applications. Multiple versionsof the same application often are required, moreover, to accommodatethis heterogeneous environment.

[0003] The types of computers and computing devices connected to globalnetworks, particularly the Internet, are extensive. In addition topersonal computers (PCs) and servers, these computing devices includecellular telephones, mobile computers, personal digital assistants(PDAs), set top boxes, digital televisions and many others. The sharingof data and applications among this assortment of computers andcomputing devices presents substantial problems.

[0004] A number of techniques have been employed in an attempt toovercome these problems. These techniques include, among others,sophisticated interfaces and complicated programming techniques. Thesesolutions often require substantial increases in processing power toimplement. They also often result in a substantial increase in the timerequired to process applications and to transmit data over networks.

[0005] Data typically are transmitted over the Internet separately fromthe corresponding applications. This approach avoids the necessity ofsending the application with each set of transmitted data correspondingto the application. While this approach minimizes the amount ofbandwidth needed, it also often causes frustration among users. Thecorrect application, or the most current application, for thetransmitted data may not be available on the client's computer. Thisapproach also requires the writing of a multiplicity of versions of eachapplication for the multiplicity of different ISAs and instruction setsemployed by the processors on the network.

[0006] The Java model attempts to solve this problem. This model employsa small application (“applet”) complying with a strict securityprotocol. Applets are sent from a server computer over the network to berun by a client computer (“client”). To avoid having to send differentversions of the same applet to clients employing different ISAs, allJava applets are run on a client's Java virtual machine. The Javavirtual machine is software emulating a computer having a Java ISA andJava instruction set. This software, however, runs on the client's ISAand the client's instruction set. A version of the Java virtual machineis provided for each different ISA and instruction set of the clients. Amultiplicity of different versions of each applet, therefore, is notrequired. Each client downloads only the correct Java virtual machinefor its particular ISA and instruction set to run all Java applets.

[0007] Although providing a solution to the problem of having to writedifferent versions of an application for each different ISA andinstruction set, the Java processing model requires an additional layerof software on the client's computer. This additional layer of softwaresignificantly degrades a processor's processing speed. This decrease inspeed is particularly significant for real-time, multimediaapplications. A downloaded Java applet also may contain viruses,processing malfunctions, etc. These viruses and malfunctions can corrupta client's database and cause other damage. Although a security protocolemployed in the Java model attempts to overcome this problem byimplementing a software “sandbox,” i.e., a space in the client's memorybeyond which the Java applet cannot write data, this software-drivensecurity model is often insecure in its implementation and requires evenmore processing.

[0008] Real-time, multimedia, network applications are becomingincreasingly important. These network applications require extremelyfast processing speeds. Many thousands of megabits of data per secondmay be needed in the future for such applications. The currentarchitecture of networks, and particularly that of the Internet, and theprogramming model presently embodied in, e.g., the Java model, makereaching such processing speeds extremely difficult.

[0009] Therefore, a new computer architecture, a new architecture forcomputer networks and a new programming model are required. This newarchitecture and programming model should overcome the problems ofsharing data and applications among the various members of a networkwithout imposing added computational burdens. This new computerarchitecture and programming model also should overcome the securityproblems inherent in sharing applications and data among the members ofa network.

SUMMARY OF THE INVENTION

[0010] In one aspect, the present invention provides a new architecturefor computers, computing devices and computer networks. In anotheraspect, the present invention provides a new programming model for thesecomputers, computing devices and computer networks.

[0011] In accordance with the present invention, all members of acomputer network, i.e., all computers and computing devices of thenetwork, are constructed from a common computing module. This commoncomputing module has a consistent structure and preferably employs thesame ISA. The members of the network can be, e.g., clients, servers,PCs, mobile computers, game machines, PDAs, set top boxes, appliances,digital televisions and other devices using computer processors. Theconsistent modular structure enables efficient, high speed processing ofapplications and data by the network's members and the rapidtransmission of applications and data over the network. This structurealso simplifies the building of members of the network of various sizesand processing power and the preparation of applications for processingby these members.

[0012] In another aspect, the present invention provides a newprogramming model for transmitting data and applications over a networkand for processing data and applications among the network's members.This programming model employs a software cell transmitted over thenetwork for processing by any of the network's members. Each softwarecell has the same structure and can contain both applications and data.As a result of the high speed processing and transmission speed providedby the modular computer architecture, these cells can be rapidlyprocessed. The code for the applications preferably is based upon thesame common instruction set and ISA. Each software cell preferablycontains a global identification (global ID) and information describingthe amount of computing resources required for the cell's processing.Since all computing resources have the same basic structure and employthe same ISA, the particular resource performing this processing can belocated anywhere on the network and dynamically assigned.

[0013] The basic processing module is a processor element (PE). A PEpreferably comprises a processing unit (PU), a direct memory accesscontroller (DMAC) and a plurality of attached processing units (APUs).In a preferred embodiment, a PE comprises eight APUs. The PU and theAPUs interact with a shared dynamic random access memory (DRAM)preferably having a cross-bar architecture. The PU schedules andorchestrates the processing of data and applications by the APUs. TheAPUs perform this processing in a parallel and independent manner. TheDMAC controls accesses by the PU and the APUs to the data andapplications stored in the shared DRAM.

[0014] In accordance with this modular structure, the number of PEsemployed by a member of the network is based upon the processing powerrequired by that member. For example, a server may employ four PEs, aworkstation may employ two PEs and a PDA may employ one PE. The numberof APUs of a PE assigned to processing a particular software celldepends upon the complexity and magnitude of the programs and datawithin the cell.

[0015] In a preferred embodiment, a plurality of PEs are associated witha shared DRAM. The DRAM preferably is segregated into a plurality ofsections, and each of these sections is segregated into a plurality ofmemory banks. In a particularly preferred embodiment, the DRAM comprisessixty-four memory banks, and each bank has one megabyte of storagecapacity. Each section of the DRAM preferably is controlled by a bankcontroller, and each DMAC of a PE preferably accesses each bankcontroller. The DMAC of each PE in this embodiment, therefore, canaccess any portion of the shared DRAM.

[0016] In another aspect, the present invention provides a synchronizedsystem and method for an APU's reading of data from, and the writing ofdata to, the shared DRAM. This system avoids conflicts among themultiple APUs and multiple PEs sharing the DRAM. In accordance with thissystem and method, an area of the DRAM is designated for storing aplurality of full-empty bits. Each of these full-empty bits correspondsto a designated area of the DRAM. The synchronized system is integratedinto the hardware of the DRAM and, therefore, avoids the computationaloverhead of a data synchronization scheme implemented in software.

[0017] The present invention also implements sandboxes within the DRAMto provide security against the corruption of data for a program beingprocessed by one APU from data for a program being processed by anotherAPU. Each sandbox defines an area of the shared DRAM beyond which aparticular APU, or set of APUs, cannot read or write data.

[0018] In another aspect, the present invention provides a system andmethod for the PUs' issuance of commands to the APUs to initiate theAPUs' processing of applications and data. These commands, called APUremote procedure calls (ARPCs), enable the PUs to orchestrate andcoordinate the APUs' parallel processing of applications and datawithout the APUs performing the role of co-processors.

[0019] In another aspect, the present invention provides a system andmethod for establishing a dedicated pipeline structure for theprocessing of streaming data. In accordance with this system and method,a coordinated group of APUS, and a coordinated group of memory sandboxesassociated with these APUs, are established by a PU for the processingof these data. The pipeline's dedicated APUs and memory sandboxes remaindedicated to the pipeline during periods that the processing of datadoes not occur. In other words, the dedicated APUs and their associatedsandboxes are placed in a reserved state during these periods.

[0020] In another aspect, the present invention provides an absolutetimer for the processing of tasks. This absolute timer is independent ofthe frequency of the clocks employed by the APUs for the processing ofapplications and data. Applications are written based upon the timeperiod for tasks defined by the absolute timer. If the frequency of theclocks employed by the APUs increases because of, e.g., enhancements tothe APUs, the time period for a given task as defined by the absolutetimer remains the same. This scheme enables the implementation ofenhanced processing times by newer versions of the APUs withoutdisabling these newer APUs from processing older applications writtenfor the slower processing times of older APUs.

[0021] The present invention also provides an alternative scheme topermit newer APUs having faster processing speeds to process olderapplications written for the slower processing speeds of older APUs. Inthis alternative scheme, the particular instructions or microcodeemployed by the APUs in processing these older applications are analyzedduring processing for problems in the coordination of the APUs' parallelprocessing created by the enhanced speeds. “No operation” (“NOOP”)instructions are inserted into the instructions executed by some ofthese APUs to maintain the sequential completion of processing by theAPUs expected by the program. By inserting these NOOPs into theseinstructions, the correct timing for the APUs' execution of allinstructions are maintained.

[0022] In another aspect, the present invention provides a chip packagecontaining an integrated circuit into which is integrated an opticalwave guide.

DESCRIPTION OF THE DRAWINGS

[0023]FIG. 1 illustrates -the overall architecture of a computer networkin accordance with the present invention.

[0024]FIG. 2 is a diagram illustrating the structure of a processorelement (PE) in accordance with the present invention.

[0025]FIG. 3 is a diagram illustrating the structure of a broadbandengine (BE) in accordance with the present invention.

[0026]FIG. 4 is a diagram illustrating the structure of an attachedprocessing unit (APU) in accordance with the present invention.

[0027]FIG. 5 is a diagram illustrating the structure of a processorelement, visualizer (VS) and an optical interface in accordance with thepresent invention.

[0028]FIG. 6 is a diagram illustrating one combination of processorelements in accordance with the present invention.

[0029]FIG. 7 illustrates another combination of processor elements inaccordance with the present invention.

[0030]FIG. 8 illustrates yet another combination of processor elementsin accordance with the present invention.

[0031]FIG. 9 illustrates yet another combination of processor elementsin accordance with the present invention.

[0032]FIG. 10 illustrates yet another combination of processor elementsin accordance with the present invention.

[0033]FIG. 11A illustrates the integration of optical interfaces withina chip package in accordance with the present invention.

[0034]FIG. 11B is a diagram of one configuration of processors using theoptical interfaces of FIG. 11A.

[0035]FIG. 11C is a diagram of another configuration of processors usingthe optical interfaces of FIG. 11A.

[0036]FIG. 12A illustrates the structure of a memory system inaccordance with the present invention.

[0037]FIG. 12B illustrates the writing of data from a first broadbandengine to a second broadband engine in accordance with the presentinvention.

[0038]FIG. 13 is a diagram of the structure of a shared memory for aprocessor element in accordance with the present invention.

[0039]FIG. 14A illustrates one structure for a bank of the memory shownin FIG. 13.

[0040]FIG. 14B illustrates another structure for a bank of the memoryshown in FIG. 13.

[0041]FIG. 15 illustrates a structure for a direct memory accesscontroller in accordance with the present invention.

[0042]FIG. 16 illustrates an alternative structure for a direct memoryaccess controller in accordance with the present invention.

[0043] FIGS. 17A-17O illustrate the operation of data synchronization inaccordance with the present invention.

[0044]FIG. 18 is a three-state memory diagram illustrating the variousstates of a memory location in accordance with the data synchronizationscheme of the-present invention.

[0045]FIG. 19 illustrates the structure of a key control table for ahardware sandbox in accordance with the present invention.

[0046]FIG. 20 illustrates a scheme for storing memory access keys for ahardware sandbox in accordance with the present invention.

[0047]FIG. 21 illustrates the structure of a memory access control tablefor a hardware sandbox in accordance with the present invention.

[0048]FIG. 22 is a flow diagram of the steps for accessing a memorysandbox using the key control table of FIG. 19 and the memory accesscontrol table of FIG. 21.

[0049]FIG. 23 illustrates the structure of a software cell in accordancewith the present invention.

[0050]FIG. 24 is a flow diagram of the steps for issuing remoteprocedure calls to APUs in accordance with the present invention.

[0051]FIG. 25 illustrates the structure of a dedicated pipeline forprocessing streaming data in accordance with the present invention.

[0052]FIG. 26 is a flow diagram of the steps performed by the dedicatedpipeline of FIG. 25 in the processing of streaming data in accordancewith the present invention.

[0053]FIG. 27 illustrates an alternative structure for a dedicatedpipeline for the processing of streaming data in accordance with thepresent invention.

[0054]FIG. 28 illustrates a scheme for an absolute timer forcoordinating the parallel processing of applications and data by APUs inaccordance with the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0055] The overall architecture for a computer system 101 in accordancewith the present invention is shown in FIG. 1.

[0056] As illustrated in this figure, system 101 includes network 104 towhich is connected a plurality of computers and computing devices.Network 104 can be a LAN, a global network, such as the Internet, or anyother computer network.

[0057] The computers and computing devices connected to network 104 (thenetwork's “members”) include, e.g., client computers 106, servercomputers 108, personal digital assistants (PDAs) 110, digitaltelevision (DTV) 112 and other wired or wireless computers and computingdevices. The processors employed by the members of network 104 areconstructed from the same common computing module. These processors alsopreferably all have the same ISA and perform processing in accordancewith the same instruction set. The number of modules included within anyparticular processor depends upon the processing power required by thatprocessor.

[0058] For example, since servers 108 of system 101 perform moreprocessing of data and applications than clients 106, servers 108contain more computing modules than clients 106. PDAs 110, on the otherhand, perform the least amount of processing. PDAs 110, therefore,contain the smallest number of computing modules. DTV 112 performs alevel of processing between that of clients 106 and servers 108. DTV112, therefore, contains a number of computing modules between that ofclients 106 and servers 108. As discussed below, each computing modulecontains a processing controller and a plurality of identical processingunits for performing parallel processing of the data and applicationstransmitted over network 104.

[0059] This homogeneous configuration for system 101 facilitatesadaptability, processing speed and processing efficiency. Because eachmember of system 101 performs processing using one or more (or somefraction) of the same computing module, the particular computer orcomputing device performing the actual processing of data andapplications is unimportant. The processing of a particular applicationand data, moreover, can be shared among the network's members. Byuniquely identifying the cells comprising the data and applicationsprocessed by system 101 throughout the system, the processing resultscan be transmitted to the computer or computing device requesting theprocessing regardless of where this processing occurred. Because themodules performing this processing have a common structure and employ acommon ISA, the computational burdens of an added layer of software toachieve compatibility among the processors is avoided. This architectureand programming model facilitates the processing speed necessary toexecute, e.g., real-time, multimedia applications.

[0060] To take further advantage of the processing speeds andefficiencies facilitated by system 101, the data and applicationsprocessed by this system are packaged into uniquely identified,uniformly formatted software cells 102. Each software cell 102 contains,or can contain, both applications and data. Each software cell alsocontains an ID to globally identify the cell throughout network 104 andsystem 101. This uniformity of structure for the software cells, and thesoftware cells' unique identification throughout the network,facilitates the processing of applications and data on any computer orcomputing device of the network. For example, a client 106 may formulatea software cell 102 but, because of the limited processing capabilitiesof client 106, transmit this software cell to a server 108 forprocessing. Software cells can migrate, therefore, throughout network104 for processing on the basis of the availability of processingresources on the network.

[0061] The homogeneous structure of processors and software cells ofsystem 101 also avoids many of the problems of today's heterogeneousnetworks. For example, inefficient programming models which seek topermit processing of applications on any ISA using any instruction set,e.g., virtual machines such as the Java virtual machine, are avoided.System 101, therefore, can implement broadband processing far moreeffectively and efficiently than today's networks.

[0062] The basic processing module for all members of network 104 is theprocessor element (PE). FIG. 2 illustrates the structure of a PE. Asshown in this figure, PE 201 comprises a processing unit (PU) 203, adirect memory access controller (DMAC) 205 and a plurality of attachedprocessing units (APUs), namely, APU 207, APU 209, APU 211, APU 213, APU215, APU 217, APU 219 and APU 221. A local PE bus 223 transmits data andapplications among the APUs, DMAC 205 and PU 203. Local PE bus 223 canhave, e.g., a conventional architecture or be implemented as a packetswitch network. Implementation as a packet switch network, whilerequiring more hardware, increases available bandwidth.

[0063] PE 201 can be constructed using various methods for implementingdigital logic. PE 201 preferably is constructed, however, as a singleintegrated circuit employing a complementary metal oxide semiconductor(CMOS) on a silicon substrate. Alternative materials for substratesinclude gallium arsinide, gallium aluminum arsinide and other so-calledIII-B compounds employing a wide variety of dopants. PE 201 also couldbe implemented using superconducting material, e.g., rapidsingle-flux-quantum (RSFQ) logic.

[0064] PE 201 is closely associated with a dynamic random access memory(DRAM) 225 through a high bandwidth memory connection 227. DRAM 225functions as the main memory for PE 201. Although a DRAM 225 preferablyis a dynamic random access memory, DRAM 225 could be implemented usingother means, e.g., as a static random access memory (SRAM), a magneticrandom access memory (MRAM), an optical memory or a holographic memory.DMAC 205 facilitates the transfer of data between DRAM 225 and the APUsand PU of PE 201. As further discussed below, DMAC 205 designates foreach APU an exclusive area in DRAM 225 into which only the APU can writedata and from which only the APU can read data. This exclusive area isdesignated a “sandbox.”

[0065] PU 203 can be, e.g., a standard processor capable of stand-aloneprocessing of data and applications. In operation, PU 203 schedules andorchestrates the processing of data and applications by the APUs. TheAPUs preferably are single instruction, multiple data (SIMD) processors.Under the control of PU 203, the APUs perform the processing of thesedata and applications in a parallel and independent manner. DMAC 205controls accesses by PU 203 and the APUs to the data and applicationsstored in the shared DRAM 225. Although PE 201 preferably includes eightAPUs, a greater or lesser number of APUs can be employed in a PEdepending upon the processing power required. Also, a number of PEs,such as PE 201, may be joined or packaged together to provide enhancedprocessing power.

[0066] For example, as shown in FIG. 3, four PEs may be packaged orjoined together, e.g., within one or more chip packages, to form asingle processor for a member of network 104. This configuration isdesignated a broadband engine (BE). As shown in FIG. 3, BE 301 containsfour PEs, namely, PE 303, PE 305, PE 307 and PE 309. Communicationsamong these PEs are over BE bus 311. Broad bandwidth memory connection313 provides communication between shared DRAM 315 and these PEs. Inlieu of BE bus 311, communications among the PEs of BE 301 can occurthrough DRAM 315 and this memory connection.

[0067] Input/output (I/O) interface 317 and external bus 319 providecommunications between broadband engine 301 and the other members ofnetwork 104. Each PE of BE 301 performs processing of data andapplications in a parallel and independent manner analogous to theparallel and independent processing of applications and data performedby the APUs of a PE.

[0068]FIG. 4 illustrates the structure of an APU. APU 402 includes localmemory 406, registers 410, four floating point units 412 and fourinteger units 414. Again, however, depending upon the processing powerrequired, a greater or lesser number of floating points units 512 andinteger units 414 can be employed. In a preferred embodiment, localmemory 406 contains 128 kilobytes of storage, and the capacity ofregisters 410 is 128×128 bits. Floating point units 412 preferablyoperate at a speed of 32 billion floating point operations per second(32 GFLOPS), and integer units 414 preferably operate at a speed of 32billion operations per second (32 GOPS).

[0069] Local memory 402 is not a cache memory. Local memory 402 ispreferably constructed as an SRAM. Cache coherency support for an APU isunnecessary. A PU may require cache coherency support for direct memoryaccesses initiated by the PU. Cache coherency support is not required,however, for direct memory accesses initiated by an APU or for accessesfrom and to external devices.

[0070] APU 402 further includes bus 404 for transmitting applicationsand data to and from the APU. In a preferred embodiment, this bus is1,024 bits wide. APU 402 further includes internal busses 408, 420 and418. In a preferred embodiment, bus 408 has a width of 256 bits andprovides communications between local memory 406 and registers 410.Busses 420 and 418 provide communications between, respectively,registers 410 and floating point units 412, and registers 410 andinteger units 414. In a preferred embodiment, the width of busses 418and 420 from registers 410 to the floating point or integer units is 384bits, and the width of busses 418 and 420 from the floating point orinteger units to registers 410 is 128 bits. The larger width of thesebusses from registers 410 to the floating point or integer units thanfrom these units to registers 410 accommodates the larger data flow fromregisters 410 during processing. A maximum of three words are needed foreach calculation. The result of each calculation, however, normally isonly one word.

[0071] FIGS. 5-10 further illustrate the modular structure of theprocessors of the members of network 104. For example, as shown in FIG.5, a processor may comprise a single PE 502. As discussed above, this PEtypically comprises a PU, DMAC and eight APUs. Each APU includes localstorage (LS) . On the other hand, a processor may comprise the structureof visualizer (VS) 505. As shown in FIG. 5, VS 505 comprises PU 512,DMAC 514 and four APUs, namely, APU 516, APU 518, APU 520 and APU 522.The space within the chip package normally occupied by the other fourAPUs of a PE is occupied in this case by pixel engine 508, image cache510 and cathode ray tube controller (CRTC) 504. Depending upon the speedof communications required for PE 502 or VS 505, optical interface 506also may be included on the chip package.

[0072] Using this standardized, modular structure, numerous othervariations of processors can be constructed easily and efficiently. Forexample, the processor shown in FIG. 6 comprises two chip packages,namely, chip package 602 comprising a BE and chip package 604 comprisingfour VSs. Input/output (I/O) 606 provides an interface between the BE ofchip package 602 and network 104. Bus 608 provides communicationsbetween chip package 602 and chip package 604. Input output processor(IOP) 610 controls the flow of data into and out of I/O 606. I/O 606 maybe fabricated as an application specific integrated circuit (ASIC). Theoutput from the VSs is video signal 612.

[0073]FIG. 7 illustrates a chip package for a BE 702 with two opticalinterfaces 704 and 706 for providing ultra high speed communications tothe other members of network 104 (or other chip packages locallyconnected). BE 702 can function as, e.g., a server on network 104.

[0074] The chip package of FIG. 8 comprises two PEs 802 and 804 and twoVSs 806 and 808. An I/O 810 provides an interface between the chippackage and network 104. The output from the chip package is a videosignal. This configuration may function as, e.g., a graphics workstation.

[0075]FIG. 9 illustrates yet another configuration. This configurationcontains one-half of the processing power of the configurationillustrated in FIG. 8. Instead of two PEs, one PE 902 is provided, andinstead of two VSs, one VS 904 is provided. I/O 906 has one-half thebandwidth of the I/O illustrated in FIG. 8. Such a processor also mayfunction, however, as a graphics work station.

[0076] A final configuration is shown in FIG. 10. This processorconsists of only a single VS 1002 and an I/O 1004. This configurationmay function as, e.g., a PDA.

[0077]FIG. 11A illustrates the integration of optical interfaces into achip package of a processor of network 104. These optical interfacesconvert optical signals to electrical signals and electrical signals tooptical signals and can be constructed from a variety of materialsincluding, e.g., gallium arsinide, aluminum gallium arsinide, germaniumand other elements or compounds. As shown in this figure, opticalinterfaces 1104 and 1106 are fabricated on the chip package of BE 1102.BE bus 1108 provides communication among the PEs of BE 1102, namely, PE1110, PE 1112, PE 1114, PE 1116, and these optical interfaces. Opticalinterface 1104 includes two ports, namely, port 1118 and port 1120, andoptical interface 1106 also includes two ports, namely, port 1122 andport 1124. Ports 1118, 1120, 1122 and 1124 are connected to,respectively, optical wave guides 1126, 1128, 1130 and 1132. Opticalsignals are transmitted to and from BE 1102 through these optical waveguides via the ports of optical interfaces 1104 and 1106.

[0078] plurality of BEs can be connected together in variousconfigurations using such optical wave guides and the four optical portsof each BE. For example, as shown in FIG. 11B, two or more BEs, e.g., BE1152, BE 1154 and BE 1156, can be connected serially through suchoptical ports. In this example, optical interface 1166 of BE 1152 isconnected through its optical ports to the optical ports of opticalinterface 1160 of BE 1154. In a similar manner, the optical ports ofoptical interface 1162 on BE 1154 are connected to the optical ports ofoptical interface 1164 of BE 1156.

[0079] A matrix configuration is illustrated in FIG. 1lC. In thisconfiguration, the optical interface of each BE is connected to twoother BEs. As shown in this figure, one of the optical ports of opticalinterface 1188 of BE 1172 is connected to an optical port of opticalinterface 1182 of BE 1176. The other optical port of optical interface1188 is connected to an optical port of optical interface 1184 of BE1178. In a similar manner, one optical port of optical interface 1190 ofBE 1174 is connected to the other optical port of optical interface 1184of BE 1178. The other optical port of optical interface 1190 isconnected to an optical port of optical interface 1186 of BE 1180. Thismatrix configuration can be extended in a similar manner to other BEs.

[0080] Using either a serial configuration or a matrix configuration, aprocessor for network 104 can be constructed of any desired size andpower. Of course, additional ports can be added to the opticalinterfaces of the BEs, or to processors having a greater or lessernumber of PEs than a BE, to form other configurations.

[0081]FIG. 12A illustrates the control system and structure for the DRAMof a BE. A similar control system and structure is employed inprocessors having other sizes and containing more or less PEs. As shownin this figure, a cross-bar switch connects each DMAC 1210 of the fourPEs comprising BE 1201 to eight bank controls 1206. Each bank control1206 controls eight banks 1208 (only four are shown in the figure) ofDRAM 1204. DRAM 1204, therefore, comprises a total of sixty-four banks.In a preferred embodiment, DRAM 1204 has a capacity of 64 megabytes, andeach bank has a capacity of 1 megabyte. The smallest addressable unitwithin each bank, in this preferred embodiment, is a block of 1024 bits.

[0082] BE 1201 also includes switch unit 1212. Switch unit 1212 enablesother APUs on BEs closely coupled to BE 1201 to access DRAM 1204. Asecond BE, therefore, can be closely coupled to a first BE, and each APUof each BE can address twice the number of memory locations normallyaccessible to an APU. The direct reading or writing of data from or tothe DRAM of a first BE from or to the DRAM of a second BE can occurthrough a switch unit such as switch unit 1212.

[0083] For example, as shown in FIG. 12B, to accomplish such writing,the APU of a first BE, e.g., APU 1220 of BE 1222, issues a write commandto a memory location of a DRAM of a second BE, e.g., DRAM 1228 of BE1226 (rather than, as in the usual case, to DRAM 1224 of BE 1222). DMAC1230 of BE 1222 sends the write command through cross-bar switch 1221 tobank control 1234, and bank control 1234 transmits the command to anexternal port 1232 connected to bank control 1234. DMAC 1238 of BE 1226receives the write command and transfers this command to switch unit1240 of BE 1226. Switch unit 1240 identifies the DRAM address containedin the write command and sends the data for storage in this addressthrough bank control 1242 of BE 1226 to bank 1244 of DRAM 1228. Switchunit 1240, therefore, enables both DRAM 1224 and DRAM 1228 to functionas a single memory space for the APUs of BE 1222.

[0084]FIG. 13 shows the configuration of the sixty-four banks of a DRAM.These banks are arranged into eight rows, namely, rows 1302, 1304, 1306,1308, 1310, 1312, 1314 and 1316 and eight columns, namely, columns 1320,1322, 1324, 1326, 1328, 1330, 1332 and 1334. Each row is controlled by abank controller. Each bank controller, therefore, controls eightmegabytes of memory.

[0085]FIGS. 14A and 14B illustrate different configurations for storingand accessing the smallest addressable memory unit of a DRAM, e.g., ablock of 1024 bits. In FIG. 14A, DMAC 1402 stores in a single bank 1404eight 1024 bit blocks 1406. In FIG. 14B, on the other hand, while DMAC1412 reads and writes blocks of data containing 1024 bits, these blocksare interleaved between two banks, namely, bank 1414 and bank 1416. Eachof these banks, therefore, contains sixteen blocks of data, and eachblock of data contains 512 bits. This interleaving can facilitate fasteraccessing of the DRAM and is useful in the processing of certainapplications.

[0086]FIG. 15 illustrates the architecture for a DMAC 1504 within a PE.As illustrated in this figure, the structural hardware comprising DMAC1506 is distributed throughout the PE such that each APU 1502 has directaccess to a structural node 1504 of DMAC 1506. Each node executes thelogic appropriate for memory accesses by the APU to which the node hasdirect access.

[0087]FIG. 16 shows an alternative embodiment of the DMAC, namely, anon-distributed architecture. In this case, the structural hardware ofDMAC 1606 is centralized. APUs 1602 and PU 1604 communicate with DMAC1606 via local PE bus 1607. DMAC 1606 is connected through a cross-barswitch to a bus 1608. Bus 1608 is connected to DRAM 1610.

[0088] As discussed above, all of the multiple APUs of a PE canindependently access data in the shared DRAM. As a result, a first APUcould be operating upon particular data in its local storage at a timeduring which a second APU requests these data. If the data were providedto the second APU at that time from the shared DRAM, the data could beinvalid because of the first APU's ongoing processing which could changethe data's value. If the second processor received the data from theshared DRAM at that time, therefore, the second processor could generatean erroneous result. For example, the data could be a specific value fora global variable. If the first processor changed that value during itsprocessing, the second processor would receive an outdated value. Ascheme is necessary, therefore, to synchronize the APUs' reading andwriting of data from and to memory locations within the shared DRAM.This scheme must prevent the reading of data from a memory location uponwhich another APU currently is operating in its local storage and,therefore, which are not current, and the writing of data into a memorylocation storing current data.

[0089] To overcome these problems, for each addressable memory locationof the DRAM, an additional segment of memory is allocated in the DRAMfor storing status information relating to the data stored in the memorylocation. This status information includes a full/empty (F/E) bit, theidentification of an APU (APU ID) requesting data from the memorylocation and the address of the APU's local storage (LS address) towhich the requested data should be read. An addressable memory locationof the DRAM can be of any size. In a preferred embodiment, this size is1024 bits.

[0090] The setting of the F/E bit to 1 indicates that the data stored inthe associated memory location are current. The setting of the F/E bitto 0, on the other hand, indicates that the data stored in theassociated memory location are not current. If an APU requests the datawhen this bit is set to 0, the APU is prevented from immediately readingthe data. In this case, an APU ID identifying the APU requesting thedata, and an LS address identifying the memory location within the localstorage of this APU to which the data are to be read when the databecome current, are entered into the additional memory segment.

[0091] An additional memory segment also is allocated for each memorylocation within the local storage of the APUs. This additional memorysegment stores one bit, designated the “busy bit.” The busy bit is usedto reserve the associated LS memory location for the storage of specificdata to be retrieved from the DRAM. If the busy bit is set to 1 for aparticular memory location in local storage, the APU can use this memorylocation only for the writing of these specific data. On the other hand,if the busy bit is set to 0 for a particular memory location in localstorage, the APU can use this memory location for the writing of anydata.

[0092] Examples of the manner in which the F/E bit, the APU ID, the LSaddress and the busy bit are used to synchronize the reading and writingof data from and to the shared DRAM of a PE are illustrated in FIGS.17A-17O.

[0093] As shown in FIG. 17A, one or more PEs, e.g., PE 1720, interactwith DRAM 1702. PE 1720 includes APU 1722 and APU 1740. APU 1722includes control logic 1724, and APU 1740 includes control logic 1742.APU 1722 also includes local storage 1726. This local storage includes aplurality of addressable memory locations 1728. APU 1740 includes localstorage 1744, and this local storage also includes a plurality ofaddressable memory locations 1746. All of these addressable memorylocations preferably are 1024 bits in size.

[0094] An additional segment of memory is associated with each LSaddressable memory location. For example, memory segments 1729 and 1734are associated with, respectively, local memory locations 1731 and 1732,and memory segment 1752 is associated with local memory location 1750. A“busy bit,” as discussed above, is stored in each of these additionalmemory segments. Local memory location 1732 is shown with several Xs toindicate that this location contains data.

[0095] DRAM 1702 contains a plurality of addressable memory locations1704, including memory locations 1706 and 1708. These memory locationspreferably also are 1024 bits in size. An additional segment of memoryalso is associated with each of these memory locations. For example,additional memory segment 1760 is associated with memory location 1706,and additional memory segment 1762 is associated with memory location1708. Status information relating to the data stored in each memorylocation is stored in the memory segment associated with the memorylocation. This status information includes, as discussed above, the F/Ebit, the APU ID and the LS address. For example, for memory location1708, this status information includes F/E bit 1712, APU ID 1714 and LSaddress 1716.

[0096] Using the status information and the busy bit, the synchronizedreading and writing of data from and to the shared DRAM among the APUsof a PE, or a group of PEs, can be achieved.

[0097]FIG. 17B illustrates the initiation of the synchronized writing ofdata from LS memory location 1732 of APU 1722 to memory location 1708 ofDRAM 1702. Control 1724 of APU 1722 initiates the synchronized writingof these data. Since memory location 1708 is empty, F/E bit 1712 is setto 0. As a result, the data in LS location 1732 can be written intomemory location 1708. If this bit were set to 1 to indicate that memorylocation 1708 is full and contains current, valid data, on the otherhand, control 1722 would receive an error message and be prohibited fromwriting data into this memory location.

[0098] The result of the successful synchronized writing of the datainto memory location 1708 is shown in FIG. 17C. The written data arestored in memory location 1708, and F/E bit 1712 is set to 1. Thissetting indicates that memory location 1708 is full and that the data inthis memory location are current and valid.

[0099]FIG. 17D illustrates the initiation of the synchronized reading ofdata from memory location 1708 of DRAM 1702 to LS memory location 1750of local storage 1744. To initiate this reading, the busy bit in memorysegment 1752 of LS memory location 1750 is set to 1 to reserve thismemory location for these data. The setting of this busy bit to 1prevents APU 1740 from storing other data in this memory location.

[0100] As shown in FIG. 17E, control logic 1742 next issues asynchronize read command for memory location 1708 of DRAM 1702. SinceF/E bit 1712 associated with this memory location is set to 1, the datastored in memory location 1708 are considered current and valid. As aresult, in preparation for transferring the data from memory location1708 to LS memory location 1750, F/E bit 1712 is set to 0. This settingis shown in FIG. 17F. The setting of this bit to 0 indicates that,following the reading of these data, the data in memory location 1708will be invalid.

[0101] As shown in FIG. 17G, the data within memory location 1708 nextare read from memory location 1708 to LS memory location 1750. FIG. 17Hshows the final state. A copy of the data in memory location 1708 isstored in LS memory location 1750. F/E bit 1712 is set to 0 to indicatethat the data in memory location 1708 are invalid. This invalidity isthe result of alterations to these data to be made by APU 1740. The busybit in memory segment 1752 also is set to 0. This setting indicates thatLS memory location 1750 now is available to APU 1740 for any purpose,i.e., this LS memory location no longer is in a reserved state waitingfor the receipt of specific data. LS memory location 1750, therefore,now can be accessed by APU 1740 for any purpose.

[0102] FIGS. 17I-170 illustrate the synchronized reading of data from amemory location of DRAM 1702, e.g., memory location 1708, to an LSmemory location of an APU's local storage, e.g., LS memory location 1752of local storage 1744, when the F/E bit for the memory location of DRAM1702 is set to 0 to indicate that the data in this memory location arenot current or valid. As shown in FIG. 17I, to initiate this transfer,the busy bit in memory segment 1752 of LS memory location 1750 is set to1 to reserve this LS memory location for this transfer of data. As shownin FIG. 17J, control logic 1742 next issues a synchronize read commandfor memory location 1708 of DRAM 1702. Since the F/E bit associated withthis memory location, F/E bit 1712, is set to 0, the data stored inmemory location 1708 are invalid. As a result, a signal is transmittedto control logic 1742 to block the immediate reading of data from thismemory location.

[0103] As shown in FIG. 17K, the APU ID 1714 and LS address 1716 forthis read command next are written into memory segment 1762. In thiscase, the APU ID for APU 1740 and the LS memory location for LS memorylocation 1750 are written into memory segment 1762. When the data withinmemory location 1708 become current, therefore, this APU ID and LSmemory location are used for determining the location to which thecurrent data are to be transmitted.

[0104] The data in memory location 1708 become valid and current when anAPU writes data into this memory location. The synchronized writing ofdata into memory location 1708 from, e.g., memory location 1732 of APU1722, is illustrated in FIG. 17L. This synchronized writing of thesedata is permitted because F/E bit 1712 for this memory location is setto 0.

[0105] As shown in FIG. 17M, following this writing, the data in memorylocation 1708 become current and valid. APU ID 1714 and LS address 1716from memory segment 1762, therefore, immediately are read from memorysegment 1762, and this information then is deleted from this segment.F/E bit 1712 also is set to 0 in anticipation of the immediate readingof the data in memory location 1708. As shown in FIG. 17N, upon readingAPU ID 1714 and LS address 1716, this information immediately is usedfor reading the valid data in memory location 1708 to LS memory location1750 of APU 1740. The final state is shown in FIG. 17O. This figureshows the valid data from memory location 1708 copied to memory location1750, the busy bit in memory segment 1752 set to 0 and F/E bit 1712 inmemory segment 1762 set to 0. The setting of this busy bit to 0 enablesLS memory location 1750 now to be accessed by APU 1740 for any purpose.The setting of this F/E bit to 0 indicates that the data in memorylocation 1708 no longer are current and valid.

[0106]FIG. 18 summarizes the operations described above and the variousstates of a memory location of the DRAM based upon the states of the F/Ebit, the APU ID and the LS address stored in the memory segmentcorresponding to the memory location. The memory location can have threestates. These three states are an empty state 1880 in which the F/E bitis set to 0 and no information is provided for the APU ID or the LSaddress, a full state 1882 in which the F/E bit is set to 1 and noinformation is provided for the APU ID or LS address and a blockingstate 1884 in which the F/E bit is set to 0 and information is providedfor the APU ID and LS address.

[0107] As shown in this figure, in empty state 1880, a synchronizedwriting operation is permitted and results in a transition to full state1882. A synchronized reading operation, however, results in a transitionto the blocking state 1884 because the data in the memory location, whenthe memory location is in the empty state, are not current.

[0108] In full state 1882, a synchronized reading operation is permittedand results in a transition to empty state 1880. On the other hand, asynchronized writing operation in full state 1882 is prohibited toprevent overwriting of valid data. If such a writing operation isattempted in this state, no state change occurs and an error message istransmitted to the APU's corresponding control logic.

[0109] In blocking state 1884, the synchronized writing of data into thememory location is permitted and results in a transition to empty state1880. On the other hand, a synchronized reading operation in blockingstate 1884 is prohibited to prevent a conflict with the earliersynchronized reading operation which resulted in this state. If asynchronized reading operation is attempted in blocking state 1884, nostate change occurs and an error message is transmitted to the APU'scorresponding control logic.

[0110] The scheme described above for the synchronized reading andwriting of data from and to the shared DRAM also can be used foreliminating the computational resources normally dedicated by aprocessor for reading data from, and writing data to, external devices.This input/output (I/O) function could be performed by a PU. However,using a modification of this synchronization scheme, an APU running anappropriate program can perform this function. For example, using thisscheme, a PU receiving an interrupt request for the transmission of datafrom an I/O interface initiated by an external device can delegate thehandling of this request to this APU. The APU then issues a synchronizewrite command to the I/O interface. This interface in turn signals theexternal device that data now can be written into the DRAM. The APU nextissues a synchronize read command to the DRAM to set the DRAM's relevantmemory space into a blocking state. The APU also sets to 1 the busy bitsfor the memory locations of the APU's local storage needed to receivethe data. In the blocking state, the additional memory segmentsassociated with the DRAM's relevant memory space contain the APU's IDand the address of the relevant memory locations of the APU's localstorage. The external device next issues a synchronize write command towrite the data directly to the DRAM's relevant memory space. Since thismemory space is in the blocking state, the data are immediately read outof this space into the memory locations of the APU's local storageidentified in the additional memory segments. The busy bits for thesememory locations then are set to 0. When the external device completeswriting of the data, the APU issues a signal to the PU that thetransmission is complete.

[0111] Using this scheme, therefore, data transfers from externaldevices can be processed with minimal computational load on the PU. TheAPU delegated this function, however, should be able to issue aninterrupt request to the PU, and the external device should have directaccess to the DRAM.

[0112] The DRAM of each PE includes a plurality of “sandboxes.” Asandbox defines an area of the shared DRAM beyond which a particularAPU, or set of APUs, cannot read or write data. These sandboxes providesecurity against the corruption of data being processed by one APU bydata being processed by another APU. These sandboxes also permit thedownloading of software cells from network 104 into a particular sandboxwithout the possibility of the software cell corrupting data throughoutthe DRAM. In the present invention, the sandboxes are implemented in thehardware of the DRAMs and DMACs. By implementing these sandboxes in thishardware rather than in software, advantages in speed and security areobtained.

[0113] The PU of a PE controls the sandboxes assigned to the APUs. Sincethe PU normally operates only trusted programs, such as an operatingsystem, this scheme does not jeopardize security. In accordance withthis scheme, the PU builds and maintains a key control table. This keycontrol table is illustrated in FIG. 19. As shown in this figure, eachentry in key control table 1902 contains an identification (ID) 1904 foran APU, an APU key 1906 for that APU and a key mask 1908. The use ofthis key mask is explained below. Key control table 1902 preferably isstored in a relatively fast memory, such as a static random accessmemory (SRAM), and is associated with the DMAC. The entries in keycontrol table 1902 are controlled by the PU. When an APU requests thewriting of data to, or the reading of data from, a particular storagelocation of the DRAM, the DMAC evaluates the APU key 1906 assigned tothat APU in key control table 1902 against a memory access keyassociated with that storage location.

[0114] As shown in FIG. 20, a dedicated memory segment 2010 is assignedto each addressable storage location 2006 of a DRAM 2002. A memoryaccess key 2012 for the storage location is stored in this dedicatedmemory segment. As discussed above, a further additional dedicatedmemory segment 2008, also associated with each addressable storagelocation 2006, stores synchronization information for writing data to,and reading data from, the storage-location.

[0115] In operation, an APU issues a DMA command to the DMAC. Thiscommand includes the address of a storage location 2006 of DRAM 2002.Before executing this command, the DMAC looks up the requesting APU'skey 1906 in key control table 1902 using the APU's ID 1904. The DMACthen compares the APU key 1906 of the requesting APU to the memoryaccess key 2012 stored in the dedicated memory segment 2010 associatedwith the storage location of the DRAM to which the APU seeks access. Ifthe two keys do not match, the DMA command is not executed. On the otherhand, if the two keys match, the DMA command proceeds and the requestedmemory access is executed.

[0116] An alternative embodiment is illustrated in FIG. 21. In thisembodiment, the PU also maintains a memory access control table 2102.Memory access control table 2102 contains an entry for each sandboxwithin the DRAM. In the particular example of FIG. 21, the DRAM contains64 sandboxes. Each entry in memory access control table 2102 contains anidentification (ID) 2104 for a sandbox, a base memory address 2106, asandbox size 2108, a memory access key 2110 and an access key mask 2110.Base memory address 2106 provides the address in the DRAM which starts aparticular memory sandbox. Sandbox size 2108 provides the size of thesandbox and, therefore, the endpoint of the particular sandbox.

[0117]FIG. 22 is a flow diagram of the steps for executing a DMA commandusing key control table 1902 and memory access control table 2102. Instep 2202, an APU issues a DMA command to the DMAC for access to aparticular memory location or locations within a sandbox. This commandincludes a sandbox ID 2104 identifying the particular sandbox for whichaccess is requested. In step 2204, the DMAC looks up the requestingAPU's key 1906 in key control table 1902 using the APU's ID 1904. Instep 2206, the DMAC uses the sandbox ID 2104 in the command to look upin memory access control table 2102 the memory access key 2110associated with that sandbox. In step 2208, the DMAC compares the APUkey 1906 assigned to the requesting APU to the access key 2110associated with the sandbox. In step 2210, a determination is made ofwhether the two keys match. If the two keys do not match, the processmoves to step 2212 where the DMA command does not proceed and an errormessage is sent to either the requesting APU, the PU or both. On theother hand, if at step 2210 the two keys are found to match, the processproceeds to step 2214 where the DMAC executes the DMA command.

[0118] The key masks for the APU keys and the memory access keys providegreater flexibility to this system. A key mask for a key converts amasked bit into a wildcard. For example, if the key mask 1908 associatedwith an APU key 1906 has its last two bits set to “mask,” designated by,e.g., setting these bits in key mask 1908 to 1, the APU key can beeither a 1 or a 0 and still match the memory access key. For example,the APU key might be 1010. This APU key normally allows access only to asandbox having an access key of 1010. If the APU key mask for this APUkey is set to 0001, however, then this APU key can be used to gainaccess to sandboxes having an access key of either 1010 or 1011.Similarly, an access key 1010 with a mask set to 0001 can be accessed byan APU with an APU key of either 1010 or 1011. Since both the APU keymask and the memory key mask can be used simultaneously, numerousvariations of accessibility by the APUs to the sandboxes can beestablished.

[0119] The present invention also provides a new programming model forthe processors of system 101. This programming model employs softwarecells 102. These cells can be transmitted to any processor on network104 for processing. This new programming model also utilizes the uniquemodular architecture of system 101 and the processors of system 101.

[0120] Software cells are processed directly by the APUs from the APU'slocal storage. The APUs do not directly operate on any data or programsin the DRAM. Data and programs in the DRAM are read into the APU's localstorage before the APU processes these data and programs. The APU'slocal storage, therefore, includes a program counter, stack and othersoftware elements for executing these programs. The PU controls the APUsby issuing direct memory access (DMA) commands to the DMAC.

[0121] The structure of software cells 102 is illustrated in FIG. 23. Asshown in this figure, a software cell, e.g., software cell 2302,contains routing information section 2304 and body 2306. The informationcontained in routing information section 2304 is dependent upon theprotocol of network 104. Routing information section 2304 containsheader 2308, destination ID 2310, source ID 2312 and reply ID 2314. Thedestination ID includes a network address. Under the TCP/IP protocol,e.g., the network address is an Internet protocol (IP) address.Destination ID 2310 further includes the identity of the PE and APU towhich the cell should be transmitted for processing. Source ID 2314contains a network address and identifies the PE and APU from which thecell originated to enable the destination PE and APU to obtainadditional information regarding the cell if necessary. Reply ID 2314contains a network address and identifies the PE and APU to whichqueries regarding the cell, and the result of processing of the cell,should be directed.

[0122] Cell body 2306 contains information independent of the network'sprotocol. The exploded portion of FIG. 23 shows the details of cell body2306. Header 2320 of cell body 2306 identifies the start of the cellbody. Cell interface 2322 contains information necessary for the cell'sutilization. This information includes global unique ID 2324, requiredAPUs 2326, sandbox size 2328 and previous cell ID 2330.

[0123] Global unique ID 2324 uniquely identifies software cell 2302throughout network 104. Global unique ID 2324 is generated on the basisof source ID 2312, e.g. the unique identification of a PE or APU withinsource ID 2312, and the time and date of generation or transmission ofsoftware cell 2302. Required APUs 2326 provides the minimum number ofAPUs required to execute the cell. Sandbox size 2328 provides the amountof protected memory in the required APUs' associated DRAM necessary toexecute the cell. Previous cell ID 2330 provides the identity of aprevious cell in a group of cells requiring sequential execution, e.g.,streaming data.

[0124] Implementation section 2332 contains the cell's core information.This information includes DMA command list 2334, programs 2336 and data2338. Programs 2336 contain the programs to be run by the APUs (called“apulets”), e.g., APU programs 2360 and 2362, and data 2338 contain thedata to be processed with these programs. DMA command list 2334 containsa series of DMA commands needed to start the programs. These DMAcommands include DMA commands 2340, 2350, 2355 and 2358. The PU issuesthese DMA commands to the DMAC.

[0125] DMA command 2340 includes VID 2342. VID 2342 is the virtual ID ofan APU which is mapped to a physical ID when the DMA commands areissued. DMA command 2340 also includes load command 2344 and address2346. Load command 2344 directs the APU to read particular informationfrom the DRAM into local storage. Address 2346 provides the virtualaddress in the DRAM containing this information. The information can be,e.g., programs from programs section 2336, data from data section 2338or other data. Finally, DMA command 2340 includes local storage address2348. This address identifies the address in local storage where theinformation should be loaded. DMA commands 2350 contain similarinformation. Other DMA commands are also possible.

[0126] DMA command list 2334 also includes a series of kick commands,e.g., kick commands 2355 and 2358. Kick commands are commands issued bya PU to an APU to initiate the processing of a cell. DMA kick command2355 includes virtual APU ID 2352, kick command 2354 and program counter2356. Virtual APU ID 2352 identifies the APU to be kicked, kick command2354 provides the relevant kick command and program counter 2356provides the address for the program counter for executing the program.DMA kick command 2358 provides similar information for the same APU oranother APU.

[0127] As noted, the PUs treat the APUs as independent processors, notco-processors. To control processing by the APUs, therefore, the PU usescommands analogous to remote procedure calls. These commands aredesignated “APU Remote Procedure Calls” (ARPCs). A PU implements an ARPCby issuing a series of DMA commands to the DMAC. The DMAC loads the APUprogram and its associated stack frame into the local storage of an APU.The PU then issues an initial kick to the APU to execute the APUProgram.

[0128]FIG. 24 illustrates the steps of an ARPC for executing an apulet.The steps performed by the PU in initiating processing of the apulet bya designated APU are shown in the first portion 2402 of FIG. 24, and thesteps performed by the designated APU in processing the apulet are shownin the second portion 2404 of FIG. 24.

[0129] In step 2410, the PU evaluates the apulet and then designates anAPU for processing the apulet. In step 2412, the PU allocates space inthe DRAM for executing the apulet by issuing a DMA command to the DMACto set memory access keys for the necessary sandbox or sandboxes. Instep 2414, the PU enables an interrupt request for the designated APU tosignal completion of the apulet. In step 2418, the PU issues a DMAcommand to the DMAC to load the apulet from the DRAM to the localstorage of the APU. In step 2420, the DMA command is executed, and theapulet is read from the DRAM to the APU's local storage. In step 2422,the PU issues a DMA command to the DMAC to load the stack frameassociated with the apulet from the DRAM to the APU's local storage. Instep 2423, the DMA command is executed, and the stack frame is read fromthe DRAM to the APU's local storage. In step 2424, the PU issues a DMAcommand for the DMAC to assign a key to the APU to allow the APU to readand write data from and to the hardware sandbox or sandboxes designatedin step 2412. In step 2426, the DMAC updates the key control table(KTAB) with the key assigned to the APU. In step 2428, the PU issues aDMA command “kick” to the APU to start processing of the program. OtherDMA commands may be issued by the PU in the execution of a particularARPC depending upon the particular apulet.

[0130] As indicated above, second portion 2404 of FIG. 24 illustratesthe steps performed by the APU in executing the apulet. In step 2430,the APU begins to execute the apulet in response to the kick commandissued at step 2428. In step 2432, the APU, at the direction of theapulet, evaluates the apulet's associated stack frame. In step 2434, theAPU issues multiple DMA commands to the DMAC to load data designated asneeded by the stack frame from the DRAM to the APU's local storage. Instep 2436, these DMA commands are executed, and the data are read fromthe DRAM to the APU's local storage. In step 2438, the APU executes theapulet and generates a result. In step 2440, the APU issues a DMAcommand to the DMAC to store the result in the DRAM. In step 2442, theDMA command is executed and the result of the apulet is written from theAPU's local storage to the DRAM. In step 2444, the APU issues aninterrupt request to the PU to signal that the ARPC has been completed.

[0131] The ability of APUs to perform tasks independently under thedirection of a PU enables a PU to dedicate a group of APUs, and thememory resources associated with a group of APUs, to performing extendedtasks. For example, a PU can dedicate one or more APUs, and a group ofmemory sandboxes associated with these one or more APUs, to receivingdata transmitted over network 104 over an extended period and todirecting the data received during this period to one or more other APUsand their associated memory sandboxes for further processing. Thisability is particularly advantageous to processing streaming datatransmitted over network 104, e.g., streaming MPEG or streaming ATRACaudio or video data. A PU can dedicate one or more APUs and theirassociated memory sandboxes to receiving these data and one or moreother APUs and their associated memory sandboxes to decompressing andfurther processing these data. In other words, the PU can establish adedicated pipeline relationship among a group of APUs and theirassociated memory sandboxes for processing such data.

[0132] In order for such processing to be performed efficiently,however, the pipeline's dedicated APUs and memory sandboxes shouldremain dedicated to the pipeline during periods in which processing ofapulets comprising the data stream does not occur. In other words, thededicated APUs and their associated sandboxes should be placed in areserved state during these periods. The reservation of an APU and itsassociated memory sandbox or sandboxes upon completion of processing ofan apulet is called a “resident termination.” A resident terminationoccurs in response to an instruction from a PU.

[0133]FIGS. 25, 26A and 26B illustrate the establishment of a dedicatedpipeline structure comprising a group of APUs and their associatedsandboxes for the processing of streaming data, e.g., streaming MPEGdata. As shown in FIG. 25, the components of this pipeline structureinclude PE 2502 and DRAM 2518. PE 2502 includes PU 2504, DMAC 2506 and aplurality of APUs, including APU 2508, APU 2510 and APU 2512.Communications among PU 2504, DMAC 2506 and these APUs occur through PEbus 2514. Wide bandwidth bus 2516 connects DMAC 2506 to DRAM 2518. DRAM2518 includes a plurality of sandboxes, e.g., sandbox 2520, sandbox2522, sandbox 2524 and sandbox 2526.

[0134]FIG. 26A illustrates the steps for establishing the dedicatedpipeline. In step 2610, PU 2504 assigns APU 2508 to process a networkapulet. A network apulet comprises a program for processing the networkprotocol of network 104. In this case, this protocol is the TransmissionControl Protocol/Internet Protocol (TCP/IP). TCP/IP data packetsconforming to this protocol are transmitted over network 104. Uponreceipt, APU 2508 processes these packets and assembles the data in thepackets into software cells 102. In step 2612, PU 2504 instructs APU2508 to perform resident terminations upon the completion of theprocessing of the network apulet. In step 2614, PU 2504 assigns PUs 2510and 2512 to process MPEG apulets. In step 2615, PU 2504 instructs APUs2510 and 2512 also to perform resident terminations upon the completionof the processing of the MPEG apulets. In step 2616, PU 2504 designatessandbox 2520 as a source sandbox for access by APU 2508 and APU 2510. Instep 2618, PU 2504 designates sandbox 2522 as a destination sandbox foraccess by APU 2510. In step 2620, PU 2504 designates sandbox 2524 as asource sandbox for access by APU 2508 and APU 2512. In step 2622, PU2504 designates sandbox 2526 as a destination sandbox for access by APU2512. In step 2624, APU 2510 and APU 2512 send synchronize read commandsto blocks of memory within, respectively, source sandbox 2520 and sourcesandbox 2524 to set these blocks of memory into the blocking state. Theprocess finally moves to step 2628 where establishment of the dedicatedpipeline is complete and the resources dedicated to the pipeline arereserved. APUs 2508, 2510 and 2512 and their associated sandboxes 2520,2522, 2524 and 2526, therefore, enter the reserved state.

[0135]FIG. 26B illustrates the steps for processing streaming MPEG databy this dedicated pipeline. In step 2630, APU 2508, which processes thenetwork apulet, receives in its local storage TCP/IP data packets fromnetwork 104. In step 2632, APU 2508 processes these TCP/IP data packetsand assembles the data within these packets into software cells 102. Instep 2634, APU 2508 examines header 2320 (FIG. 23) of the software cellsto determine whether the cells contain MPEG data. If a cell does notcontain MPEG data, then, in step 2636, APU 2508 transmits the cell to ageneral purpose sandbox designated within DRAM 2518 for processing otherdata by other APUs not included within the dedicated pipeline. APU 2508also notifies PU 2504 of this transmission.

[0136] On the other hand, if a software cell contains MPEG data, then,in step 2638, APU 2508 examines previous cell ID 2330 (FIG. 23) of thecell to identify the MPEG data stream to which the cell belongs. In step2640, APU 2508 chooses an APU of the dedicated pipeline for processingof the cell. In this case, APU 2508 chooses APU 2510 to process thesedata. This choice is based upon previous cell ID 2330 and load balancingfactors. For example, if previous cell ID 2330 indicates that theprevious software cell of the MPEG data stream to which the softwarecell belongs was sent to APU 2510 for processing, then the presentsoftware cell normally also will be sent to APU 2510 for processing. Instep 2642, APU 2508 issues a synchronize write command to write the MPEGdata to sandbox 2520. Since this sandbox previously was set to theblocking state, the MPEG data, in step 2644, automatically is read fromsandbox 2520 to the local storage of APU 2510. In step 2646, APU 2510processes the MPEG data in its local storage to generate video data. Instep 2648, APU 2510 writes the video data to sandbox 2522. In step 2650,APU 2510 issues a synchronize read command to sandbox 2520 to preparethis sandbox to receive additional MPEG data. In step 2652, APU 2510processes a resident termination. This processing causes this APU toenter the reserved state during which the APU waits to processadditional MPEG data in the MPEG data stream.

[0137] Other dedicated structures can be established among a group ofAPUs and their associated sandboxes for processing other types of data.For example, as shown in FIG. 27, a dedicated group of APUs, e.g., APUs2702, 2708 and 2714, can be established for performing geometrictransformations upon three dimensional objects to generate twodimensional display lists. These two dimensional display lists can befurther processed (rendered) by other APUs to generate pixel data. Toperform this processing, sandboxes are dedicated to APUs 2702, 2708 and2414 for storing the three dimensional objects and the display listsresulting from the processing of these objects. For example, sourcesandboxes 2704, 2710 and 2716 are dedicated to storing the threedimensional objects processed by, respectively, APU 2702, APU 2708 andAPU 2714. In a similar manner, destination sandboxes 2706, 2712 and 2718are dedicated to storing the display lists resulting from the processingof these three dimensional objects by, respectively, APU 2702, APU 2708and APU 2714.

[0138] Coordinating APU 2720 is dedicated to receiving in its localstorage the display lists from destination sandboxes 2706, 2712 and2718. APU 2720 arbitrates among these display lists and sends them toother APUs for the rendering of pixel data.

[0139] The processors of system 101 also employ an absolute timer. Theabsolute timer provides a clock signal to the APUs and other elements ofa PE which is both independent of, and faster than, the clock signaldriving these elements. The use of this absolute timer is illustrated inFIG. 28.

[0140] As shown in this figure, the absolute timer establishes a timebudget for the performance of tasks by the APUs. This time budgetprovides a time for completing these tasks which is longer than thatnecessary for the APUs' processing of the tasks. As a result, for eachtask, there is, within the time budget, a busy period and a standbyperiod. All apulets are written for processing on the basis of this timebudget regardless of the APUs' actual processing time or speed.

[0141] For example, for a particular APU of a PE, a particular task maybe performed during busy period 2802 of time budget 2804. Since busyperiod 2802 is less than time budget 2804, a standby period 2806 occursduring the time budget. During this standby period, the APU goes into asleep mode during which less power is consumed by the APU.

[0142] The results of processing a task are not expected by other APUs,or other elements of a PE, until a time budget 2804 expires. Using thetime budget established by the absolute timer, therefore, the results ofthe APUs' processing always are coordinated regardless of the APUs'actual processing speeds.

[0143] In the future, the speed of processing by the APUs will becomefaster. The time budget established by the absolute timer, however, willremain the same. For example, as shown in FIG. 28, an APU in the futurewill execute a task in a shorter period and, therefore, will have alonger standby period. Busy period 2808, therefore, is shorter than busyperiod 2802, and standby period 2810 is longer than standby period 2806.However, since programs are written for processing on the basis of thesame time budget established by the absolute timer, coordination of theresults of processing among the APUs is maintained. As a result, fasterAPUs can process programs written for slower APUs without causingconflicts in the times at which the results of this processing areexpected.

[0144] In lieu of an absolute timer to establish coordination among theAPUs, the PU, or one or more designated APUs, can analyze the particularinstructions or microcode being executed by an APU in processing anapulet for problems in the coordination of the APUs' parallel processingcreated by enhanced or different operating speeds. “No operation”(“NOOP”) instructions can be inserted into the instructions and executedby some of the APUs to maintain the proper sequential completion ofprocessing by the APUs expected by the apulet. By inserting these NOOPsinto the instructions, the correct timing for the APUs' execution of allinstructions can be maintained.

[0145] Although the invention herein has been described with referenceto particular embodiments, it is to be understood that these embodimentsare merely illustrative of the principles and applications of thepresent invention. It is therefore to be understood that numerousmodifications may be made to the illustrative embodiments and that otherarrangements may be devised without departing from the spirit and scopeof the present invention as defined by the appended claims.

1. A computer network comprising: a plurality of processors connected tosaid network, each of said processors comprising a plurality of firstprocessing units having the same instruction set architecture and asecond processing unit for controlling said first processing units, saidfirst processing units being operable to process software cellstransmitted over said network, each of said software cells comprising aprogram compatible with said instruction set architecture, dataassociated with said program and an identification number uniquelyidentifying said software cell among all of said software cellstransmitted over said network.
 2. The network of claim 1, wherein saidsecond processing unit controls said first processing units bydetermining the programs of said software cells processed by said firstprocessing units.
 3. The network of claim 2, wherein each said firstprocessing unit includes a local memory exclusively associated with saidfirst processing unit and said first processing unit processes saidprograms from said local memory.
 4. The network of claim 1, wherein eachsaid processor further includes a main memory, said main memoryincluding a plurality of banks, each said bank including a plurality ofblocks, each said block being the lowest addressable unit of said mainmemory and having an associated memory space in said main memory forstoring information regarding the status of data stored in said block,an identification for a first processing unit and an address of a localmemory associated with said first processing unit.
 5. The network ofclaim 4, wherein said first processing units comprise means for usingsaid associated memory spaces to synchronize said first processingunits' reading of data from, and writing of data to, said blocks.
 6. Thenetwork of claim 1, wherein each of said processors further comprises adirect memory access controller.
 7. The network of claim 4, wherein eachsaid first processing unit is operable to issue a synchronize readcommand to read data from said main memory to a local memory associatedwith said first processing unit and to issue a synchronize write commandto write data from said local memory to said main memory.
 8. A computerreadable medium for storing a software cell for transmission over acomputer network, said computer network comprising a plurality ofprocessors, said software cell comprising: a program for processing byone or more of said processors; data associated with said program; and aglobal identification uniquely identifying said software cell among allsoftware cells transmitted over said network.
 9. The computer readablemedium of claim 8, wherein said software cell further comprisesinformation for routing said software cell over said network.
 10. Thecomputer readable medium of claim 9, wherein said information includesan identification for one of said plurality of processors, said oneprocessor being the processor to which said software cell is to betransmitted for processing.
 11. The computer readable medium of claim10, wherein said identification includes an internet protocol address.12. The computer readable medium of claim 9, wherein said informationincludes an identification for one of said plurality of processors, saidone processor being the processor form which said software celloriginates.
 13. The computer readable medium of claim 9, wherein saidinformation includes an identification for one of said plurality ofprocessors, said one processor being the processor to which informationregarding the processing of said software cell is to be transmitted. 14.The computer readable medium of claim 8, wherein said software cellfurther comprises information providing a plurality of direct memoryaccess commands for one of said processors.
 15. The computer readablemedium of claim 14, wherein said information comprises a virtualidentification for said one processor and addresses of a memoryassociated with said one processor for implementing said direct memoryaccess commands.
 16. The computer readable medium of claim 8, whereinsaid global identification is based upon the identity of one of saidprocessors, said one processor being a processor creating said softwarecell, and upon the time and date of said creating.
 17. The computerreadable medium of claim 8, wherein said global identification is basedupon the identity of one of said processors, said one processor being aprocessor transmitting said software cell, and upon the time and date ofsaid transmitting.
 18. A data stream of software cells for transmissionover a computer network, said computer network comprising a plurality ofprocessors, each of said software cells comprising: a program forprocessing by one or more of said processors; data associated with saidprogram; and a global identification uniquely identifying said softwarecell among all software cells transmitted over said network.
 19. Thedata stream of claim 18, wherein each said software cell furthercomprises information for routing said software cell over said network.20. The data stream of claim 19, wherein said information includes anidentification for one of said plurality of processors, said oneprocessor being the processor to which said software cell is to betransmitted for processing.
 21. The data stream of claim 20, whereinsaid identification includes an internet protocol address.
 22. The datastream of claim 19, wherein said information includes an identificationfor one of said plurality of processors, said one processor being theprocessor form which said software cell originates.
 23. The data streamof claim 19, wherein said information includes an identification for oneof said plurality of processors, said one processor being the processorto which information regarding the processing of said software cell isto be transmitted.
 24. The data stream of claim 18, wherein each saidsoftware cell further comprises information providing a plurality ofdirect memory access commands for one of said processors.
 25. The datastream of claim 24, wherein said information comprises a virtualidentification for said one processor and addresses of a memoryassociated with said one processor for implementing said direct memoryaccess commands.
 26. The data stream of claim 18, wherein said globalidentification is based upon the identity of one of said processors,said one processor being a processor creating said software cell, andupon the time and date of said creating.
 27. The data stream of claim18, wherein said global identification is based upon the identity of oneof said processors, said one processor being a processor transmittingsaid software cell, and upon the time and date of said transmitting. 28.A method for processing programs and data associated with said programson a computer processor, said computer processor comprising a mainmemory, a memory controller, a plurality of first processing units, eachsaid first processing unit including a local memory exclusivelyassociated with said first processing unit, and a second processingunit, said method comprising: storing in said main memory said programsand said data associated with said programs; directing with said secondprocessing unit any one of said first processing units to process one ofsaid programs; directing with said second processing unit said memorycontroller to transfer said one program and data associated with saidone program from said main memory to the local memory exclusivelyassociated with said one first processing unit; instructing with saidsecond processing unit said one first processing unit to initiateprocessing of said one program from said one first processing unit'slocal memory; and in response to said instructing, processing with saidone first processing unit said one program and said data associated withsaid one program from said local memory exclusively associated with saidone first processing unit.
 29. The method of claim 28, wherein said mainmemory is a dynamic random access memory.
 30. The method of claim 28,wherein said main memory includes a plurality of memory locations, eachsaid memory location including a memory segment exclusively associatedwith said memory location.
 31. The method of claim 30, furthercomprising storing in each said memory segment status informationindicating the status of data stored in said memory segment's associatedmemory location, the identity of a first processing unit and a memoryaddress.
 32. The method of claim 31, wherein said status informationindicates the validity of said data stored in said memory segment'sassociated memory location, said identity indicates the identity of aparticular one of said first processing units and said memory addressindicates a storage location within the local memory exclusivelyassociated with said particular one first processing unit.
 33. Themethod of claim 28, wherein each of said first processing units is asingle instruction multiple data processor.
 34. The method of claim 28,wherein each of said first processing units includes a set of registers,a plurality of floating points units, and one or more buses connectingsaid set of registers to said plurality of floating point units.
 35. Themethod of claim 34, wherein each of said first processing units furtherincludes a plurality of integer units and one or more buses connectingsaid plurality of integer units to said set of registers.
 36. The methodof claim 28, wherein said computer processor comprises an opticalinterface and an optical waveguide connected to said optical interface,and further comprising converting electrical signals generated by saidprocessor to optical signals for transmission from said computerprocessor over said waveguide and converting optical signals transmittedto said processor over said waveguide to electrical signals.
 37. Themethod of claim 28, wherein each said local memory is a static randomaccess memory.
 38. The method of claim 28, wherein said computerprocessor further comprises a rendering engine, a frame buffer and adisplay controller, and further comprising generating pixel data withsaid rendering engine, temporarily storing said pixel data in said framebuffer and converting with said display controller said pixel data to avideo signal.
 39. The method of claim 28, wherein the data associatedwith said one program includes a stack frame.
 40. The method of claim28, further comprising, during said processing of said one program andsaid data associated with said one program, transferring with saidmemory controller, in response to an instruction to said memorycontroller from said one first processing unit, further data from saidmain memory to the local memory exclusively associated with said onefirst processing unit and thereafter processing said further data withsaid one first processing unit from said local memory exclusivelyassociated with said one first processing unit.
 41. The method of claim28, wherein said main memory comprises a plurality of memory bankcontrollers and a cross-bar switch for providing a connection betweeneach of said first processing units and said main memory.
 42. The methodof claim 28, further comprising prohibiting with said memory controllereach said first processing unit from reading data from, or writing datato, any of said local memories with which said first processing unit isnot exclusively associated.
 43. The method of claim 28, furthercomprising, following said processing of said one program and said dataassociated with said one program, transferring with said memorycontroller to said main memory, in response to an instruction to saidmemory controller from said one first processing unit, processed dataresulting from said processing of said one program and said dataassociated with said one program.
 44. The method of claim 28, whereinsaid memory controller is a direct memory access controller.
 45. Themethod of claim 28, wherein said computer processor is connected to anetwork and said one program is included within a software cell, saidsoftware cell containing a global identification uniquely identifyingsaid software cell among all software cells transmitted over saidnetwork.